Concentration-Based Guarantees for Low-Rank Matrix Reconstruction
نویسندگان
چکیده
We consider the problem of approximately reconstructing a partially-observed, approximately low-rank matrix. This problem has received much attention lately, mostly using the trace-norm as a surrogate to the rank. Here we study low-rank matrix reconstruction using both the trace-norm, as well as the less-studied max-norm, and present reconstruction guarantees based on existing analysis on the Rademacher complexity of the unit balls of these norms. We show how these are superior in several ways to recently published guarantees based on specialized analysis.
منابع مشابه
Fast and Provable Algorithms for Spectrally Sparse Signal Reconstruction via Low-Rank Hankel Matrix Completion
A spectrally sparse signal of order r is a mixture of r damped or undamped complex sinusoids. This paper investigates the problem of reconstructing spectrally sparse signals from a random subset of n regular time domain samples, which can be reformulated as a low rank Hankel matrix completion problem. We introduce an iterative hard thresholding (IHT) algorithm and a fast iterative hard threshol...
متن کاملLow-Rank Matrix Recovery from Row-and-Column Affine Measurements
We propose and study a row-and-column affine measurement scheme for low-rank matrix recovery. Each measurement is a linear combination of elements in one row or one column of a matrix X . This setting arises naturally in applications from different domains. However, current algorithms developed for standard matrix recovery problems do not perform well in our case, hence the need for developing ...
متن کاملLow-Rank Modeling of Local $k$-Space Neighborhoods (LORAKS) for Constrained MRI
Recent theoretical results on low-rank matrix reconstruction have inspired significant interest in low-rank modeling of MRI images. Existing approaches have focused on higher-dimensional scenarios with data available from multiple channels, timepoints, or image contrasts. The present work demonstrates that single-channel, single-contrast, single-timepoint k-space data can also be mapped to low-...
متن کاملImage Reconstruction in Compressed Remote Sensing with Low-rank and L1-norm Regularization
In this paper, we proposed a new model with nuclear-norm and L1-norm regularization for image reconstruction in aerospace remote sensing. The curvelet based L1-norm regularization promotes sparse reconstruction, while the low-rank based nuclear-norm regularization leads to a principle component solution. Split Bregman method is used to solve this problem. Numerical experiments show the proposed...
متن کاملAc-loraks: Autocalibrated Low-rank Modeling of Local K-space Neighborhoods
Introduction: Low-rank modeling of local k-space neighborhoods (LORAKS) is a recent constrained MRI framework that can enable accurate image reconstruction from sparselyand unconventionally-sampled k-space data [1,2]. Specifically, Ref. [1] showed that the k-space data for MR images that have limited spatial support or slowly-varying image phase can be mapped into structured low-rank matrices, ...
متن کامل